منابع مشابه
Learning Watershed Cuts Energy Functions
In recent work, several popular segmentation methods have been unified as energy minimization on a graph. In other work, supervised learning methods have been generalized from predicting labels to predicting structured, graph-like objects. This paper reviews these two directions and describes how they are being combined to enable traditionally unsupervised segmentation methods to be optimized (...
متن کاملFast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when very large moves are allowed. The first move we consider is an α-βswap: for a pair of labels α, β,...
متن کاملSmooth Energy Auto-Estimation for Graph Cuts Algorithm
Graph cuts is one of the best algorithms for disparity estimation. In its energy function, the smooth energy that is necessary for achieving the disparity map with good smoothness and good discontinuity varies from images to images. Based on image texture information, this paper presents a novel approach to estimate smooth energy automatically and precisely. To train the parameters of represent...
متن کاملNuclear energy.
The technical principles and practices of the civil nuclear industry are described with particular reference to fission and its products, natural and artificial radioactivity elements principally concerned and their relationships, main types of reactor, safety issues, the fuel cycle, waste management, issues related to weapon proliferation, environmental considerations and possible future devel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1994
ISSN: 0028-0836,1476-4687
DOI: 10.1038/367498b0